Distance-based vertex identification in graphs: The outer multiset dimension
نویسندگان
چکیده
منابع مشابه
Distance Two Vertex-Magic Graphs
Given an abelian group A, a graph G = (V, E) is said to have a distance two magic labeling in A if there exists a labeling l : E(G) → A − {0} such that the induced vertex labeling l∗ : V (G) → A defined by l∗(v) = ∑ e∈E(v) l(e) is a constant map, where E(v) = {e ∈ E(G) : d(v, e) < 2}. The set of all h ∈ Z+ for which G has a distance two magic labeling in Zh is called the distance two magic spec...
متن کاملThe Steiner distance dimension of graphs
For a nonempty set S of vertices of a connected graph G, the Steiner distance d(S) of S is the minimum size among all connected subgraphs whose vertex set contains S. For an ordered set W = {Wl, W2,"', Wk} of vertices in a connected graph G and a vertex v of G, the Steiner representation s(vIW) of v with respect to W is the (2k I)-vector where d i1 ,i2, ... ,ij(V) is the Steiner distance d({V,W...
متن کاملThe Directed Distance Dimension of Oriented Graphs
For a vertex v of a connected oriented graph D and an ordered set W = {w1, w2, . . . , wk} of vertices of D, the (directed distance) representation of v with respect to W is the ordered k-tuple r(v ∣ ∣ W ) = (d(v,w1), d(v, w2), . . . , d(v, wk)), where d(v, wi) is the directed distance from v to wi. The set W is a resolving set for D if every two distinct vertices of D have distinct representat...
متن کاملMinimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs
For a set D ⊂ Zn, the distance graph Pn(D) has Zn as its vertex set and the edges are between vertices i and j with |i − j| ∈ D. The circulant graph Cn(D) is defined analogously by considering operations modulo n. The minimum feedback vertex set problem consists in finding the smallest number of vertices to be removed in order to cut all cycles in the graph. This paper studies the minimum feedb...
متن کاملDistance Oracles for Vertex-Labeled Graphs
Given a graph G = (V,E) with non-negative edge lengths whose vertices are assigned a label from L = {λ1, . . . , λl}, we construct a compact distance oracle that answers queries of the form: “What is δ(v, λ)?”, where v ∈ V is a vertex in the graph, λ ∈ L a vertex label, and δ(v, λ) is the distance (length of a shortest path) between v and the closest vertex labeled λ in G. We formalize this nat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2019
ISSN: 0096-3003
DOI: 10.1016/j.amc.2019.124612